Improved Results on Online Dynamic Bin Packing
نویسندگان
چکیده
Bin packing is an NP-hard [10] classical combinatorial optimization problem. The objective is to pack a set of items into a minimum number of unit-size bins such that the total size of the items in a bin does not exceed the bin capacity. The problem has been studied extensively both in the offline and online settings [7, 8, 5]. In the online setting [11, 12], items may arrive at arbitrary time; item arrival time and item size are only known when an item arrives.
منابع مشابه
An Improved Lower Bound for a Semi-on-line Bin Packing Problem
On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows th...
متن کاملAn Improved Lower Bound for a Semi-on-line Bin Packing Problem
On-line algorithms have been extensively studied for the onedimensional bin packing problem. Semi-online property relax the online prescription in such a way that it allows some extra operations or the algorithm knows more (e.g. the optimum value) in advance. In this paper we present an improved lower bound for the asymptotic competitive ratio of any on-line bin packing algorithm which knows th...
متن کاملCompetitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing
In this paper, we study the d-dimensional dynamic bin packing problem for general ddimensional boxes, for d ≥ 2. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. Our main result is a 3-competitive online algorithm. We further study the 2and 3-dimensional problem closely and improve the competitive ratios. Technically speaking, our d-d...
متن کاملAlgorithms for Packing and Scheduling
This is the Second Year Progress Report for the “Algorithms for Packing and Scheduling” Ph.D. project. In this report, we give the aims of the project, a summary of the current results obtained, we address the questions raised in the Postgraduate Workshop, and we conclude with possible future work and a timetabled research plan. The project is concerned with the study, design, and analysis, of ...
متن کاملImproved Online Hypercube Packing
In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing problem and obtain new upper bounds of asymptotic competitive ratios. For square packing, we get an upper bound of 2.1439, which is better than 2.24437. For c...
متن کامل